Minimum-Variance Importance-Sampling Bernoulli Estimator for Fast Simulation of Linear Block Codes over Binary Symmetric Channels

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Computation of Minimum Hamming Weight for Linear Codes

In this paper, we consider the minimum Hamming weight for linear codes over special finite quasi-Frobenius rings. Furthermore, we obtain minimal free $R$-submodules of a finite quasi-Frobenius ring $R$  which contain a linear code and derive the relation between their minimum Hamming weights. Finally, we suggest an algorithm that computes this weight using the Grobner basis and we show that und...

متن کامل

Invariance Properties of Binary Linear Block Codes over a Memoryless Channels with Discrete Input

This work studies certain properties of the Probability Density Function ( ) of the bit Log-Likelihood-Ratio ( ) for binary linear block codes over a memoryless channel with discrete input and discrete or continuous output. We prove that under a set of mild conditions on the channel, the of the bit of a specific bit position is independent of the transmitted code-word. It is also shown that the...

متن کامل

Voronoi regions for binary linear block codes

The Voronoi regions of a block code govern many aspects of the code’s performance on a Gaussian channel, and they are fundamental instruments in, for example, error probability analysis and soft decision decoding. This paper presents an efficient method to find the boundaries of the Voronoi regions for an arbitrary binary linear block code. Two theoretical results together lead to the Voronoi r...

متن کامل

Performance of Interleaved Non-Binary Block Codes Over Binary Channels with Memory

The performance of Reed-Solomon codes over two classes of binary channels with memory, the queue-based channel (QBC) and the Gilbert-Elliott channel (GEC) is analyzed under the assumption of bounded distance decoding. In particular, we examine two interleaving strategies encountered when dealing with non-binary codes over a binary channel; namely, symbol interleaving and bit interleaving. An an...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Transactions on Wireless Communications

سال: 2014

ISSN: 1536-1276

DOI: 10.1109/twc.2013.113013.130884